Static-Arbitrage optimal subreplicating strategies for Basket Options
نویسندگان
چکیده
In this paper we investigate the possible values of basket options. Instead of postulating a model and pricing the basket option using that model, we consider the set of all models which are consistent with the observed prices of vanilla options of all strikes. In the case of basket options on two components we find, within this class, the model for which the price of the basket option is smallest. This price, as discovered by Rapuch and Roncalli, is associated to the lower Fréchet copula. We 1
منابع مشابه
Static-Arbitrage Bounds on the Prices of Basket Options via Linear Programming
We show that the problem of computing sharp upper and lower static-arbitrage bounds on the price of a European basket option, given the prices of other similar options, can be cast as a linear program (LP). The LP formulations readily yield super-replicating (subreplicating) strategies for the upper (lower) bound problem. The dual counterparts of the LP formulations in turn yield underlying ass...
متن کاملComputing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption of absence of arbitrage, and information about prices of other European basket options on the same underlying assets and with the same maturity. In particular, we provide a simple efficient way to compute this type of...
متن کاملComputing arbitrage upper bounds on basket options in the presence of bid-ask spreads
We study the problem of computing the sharpest static-arbitrage upper bound on the price of a European basket option, given the bid-ask prices of vanilla call options in the underlying securities. We show that this semi-infinite problem can be recast as a linear program whose size is linear in the input data size. These developments advance previous related results, and enhance the practical va...
متن کاملClosed-form solutions to static-arbitrage upper bounds on basket options
We provide a closed-form solution to the problem of computing the sharpest static-arbitrage upper bound on the price of a European basket option, given the prices of vanilla call options in the underlying securities. Unlike previous approaches to this problem, our solution technique is entirely based on linear programming. This also allows us to obtain an efficient (linearsize) linear programmi...
متن کاملHedging Basket Options by Using a Subset of Underlying Assets
The purpose of this paper is to investigate the use of Principal Component Analysis in finding the efficient subset of underlying assets for hedging European basket options. This asset selection technique can be used together with other hedging strategies to enhance the hedging performance. Meanwhile, it become practical and essential when some of the underlying assets are illiquid or even not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004